Properties of deterministic top-down grammars
نویسندگان
چکیده
منابع مشابه
Top-down Deterministic Languages
Two new families of languages, the F(k) and U(k) languages, are Introduced each of which is, in some sense, a generalization of top-down deterministic languages. This leads us to new characterizations of s-grammars and LL(1) languages. We include a characterization of the unambiguous context-free languages, generalizations of the equivalence relation on s-grammars to LL(k) grammars, and a summa...
متن کاملTesting Grammars For Top-Down Parsers
According to the software engineering perspective, grammars can be viewed as “Specifications for defining languages or compilers”. They form the basics of languages and several important kinds of software rely on grammars; e.g. compilers and parsers, debuggers, code processing tools, software modification tools, and software analysis tools. Testing a grammar to make sure that it is correct and ...
متن کاملTop-down Parsing with Simultaneous Evaluation of Noncircular Attribute Grammars
This paper introduces a machinery called attributed top-down parsing automaton which performs top{down parsing of strings and, simultaneously, the evaluation of arbitrary noncircular attribute grammars. The strategy of the machinery is based on a single depth{ rst left{to{right traversal over the syntax tree. There is no need to traverse parts of the syntax tree more than once, and hence, the s...
متن کاملContribution to deterministic top-down analysis of context-free languages
In the present paper a generalization of ZX(A:)-grammars is given, the notion of the switching function for such grammars is introduced and the model of the Parsing Machine using the switch ing function is given. We introduce the necessary notions and notation, mainly according to D. E. Knuth: An alphabet X is a finite nonempty set of symbols, and X* denotes the set of all strings on the alpha...
متن کاملA probabilistic top-down parser for minimalist grammars
This paper describes a probabilistic top-down parser for minimalist grammars. Top-down parsers have the great advantage of having a certain predictive power during the parsing, which takes place in a left-to-right reading of the sentence. Such parsers have already been well-implemented and studied in the case of Context-Free Grammars (see for example [Roa01]), which are already top-down, but th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1970
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(70)90446-8